Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
171	Microsoft Word - WebArchiving_v6.doc Add to Reading List Source URL: wiki.umiacs.umd.edu Language: English - Date: 2008-09-10 16:29:18 Combinatorial optimization NP-complete problems Graph partition PageRank Graph Cut Matching Minimum cut Graph theory Line graph
172	CS261: A Second Course in Algorithms Lecture #19: Beating Brute-Force Search∗ Tim Roughgarden† March 8, 2016 A popular myth is that, for N P -hard problems, there are no algorithms with worst-case running time better Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-03-15 10:47:56 NP-complete problems Computational complexity theory Analysis of algorithms Operations research NP-hard problems Vertex cover Travelling salesman problem Dynamic programming Parameterized complexity Independent set Algorithm 2-satisfiability
173	The Price of Connectivity for Feedback Vertex Set R´emy Belmonte1,∗ , Pim van ’t Hof1,∗ , Marcin Kami´ nski2 , and 3,† Dani¨el Paulusma 1 Add to Reading List Source URL: rutcor.rutgers.edu Language: English - Date: 2013-04-23 04:25:37 Graph theory NP-complete problems Planar graph Dominating set Vertex Degree Cycle Line graph Bidimensionality
174	1. Thank you for the invitation. 2. I gave an invited talk at CCA in Hagen, I think it was in 2008, where I spoke about real numbers. Today I am speaking about real numbers again. You know what to expect the next time. Add to Reading List Source URL: math.andrej.com Language: English - Date: 2016-06-16 04:03:45 Elementary mathematics Metric geometry Order theory Real numbers Real algebraic geometry Complete metric space Cauchy sequence Construction of the real numbers Augustin-Louis Cauchy Sequence Least-upper-bound property Completeness
175	Coreset and sampling approaches for the analysis of very large data sets – Part II Christian Sohler Prof. Dr. Christian Sohler Komplexitätstheorie und Add to Reading List Source URL: quentin.mrgt.fr Language: English - Date: 2014-01-09 09:41:45 Graph theory Graph NP-complete problems Graph coloring
176	One-Dimensional Partitioning for Heterogeneous Systems: Theory and Practice ⋆ Ali Pınar a,1, E. Kartal Tabak b and Cevdet Aykanat b,2 Add to Reading List Source URL: www.sandia.gov Language: English - Date: 2012-03-07 01:50:39 NP-complete problems Operations research Combinatorial optimization Parallel computing Mathematical optimization Parametric search Algorithm Dynamic programming Greedy algorithm Partition problem Distributed computing Approximation algorithm
177	CS264: Homework #4 Due by midnight on Wednesday, October 22, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at http://rishig.sc Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-10-16 11:28:02 NP-complete problems Vertex cover Maximum cut Dynamic programming Algorithm Kernelization Approximation algorithm
178	CS264: Beyond Worst-Case Analysis Lecture #5: Computing Independent Sets: A Parameterized Analysis ∗ Tim Roughgarden† October 8, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-11-02 12:35:58 NP-complete problems Approximation algorithm Independent set Algorithm Maximal independent set Longest path problem Vertex cover
179	NP-complete Problems and Physical Reality arXiv:quant-ph/0502072v2 21 Feb 2005 Scott Aaronson∗ Add to Reading List Source URL: cqi.inf.usi.ch Language: English - Date: 2012-02-22 09:04:08 Computational complexity theory Complexity classes Quantum computing Theoretical computer science Mathematical optimization Quantum algorithm NP P versus NP problem BQP PP Low Time complexity
180	Disambiguating Road Names in Text Route Descriptions using Exact-All-Hop Shortest Path Algorithm Xiao Zhang⋆ △ and Baojun Qiu⋆⋄ and Prasenjit Mitra⋆† and Sen Xu‡ and Alexander Klippel‡ and Alan M. MacEach Add to Reading List Source URL: cognitivegiscience.psu.edu Language: English - Date: 2012-07-13 14:23:32 Network theory Routing algorithms Edsger W. Dijkstra Graph connectivity NP-complete problems Shortest path problem Distance Path Longest path problem K shortest path routing FloydWarshall algorithm

UPDATE